Protected Nodes and Fringe Subtrees in Some Random Trees
نویسندگان
چکیده
We study protected nodes in various classes of random rooted trees by putting them in the general context of fringe subtrees introduced by Aldous (1991). Several types of random trees are considered: simply generated trees (or conditioned Galton– Watson trees), which includes several cases treated separately by other authors, binary search trees and random recursive trees. This gives unified and simple proofs of several earlier results, as well as new results.
منابع مشابه
Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees
We study fringe subtrees of random m-ary search trees and of preferential attachment trees, by putting them in the context of generalised Pólya urns. In particular we show that for the random m-ary search trees with m ≤ 26 and for the linear preferential attachment trees, the number of fringe subtrees that are isomorphic to an arbitrary fixed tree T converges to a normal distribution; more gene...
متن کاملUsing Stein’s Method to Show Poisson and Normal Limit Laws for Fringe Subtrees
We consider sums of functions of fringe subtrees of binary search trees and random recursive trees (of total size n). The use of Stein’s method and certain couplings allow provision of simple proofs showing that in both of these trees, the number of fringe subtrees of size k < n, where k → ∞, can be approximated by a Poisson distribution. Combining these results and another version of Stein’s m...
متن کاملLimit laws for functions of fringe trees for binary search trees and random recursive trees
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees and random recursive trees. The proofs use a new version of a representation by Devroye, and Stein’s method for both normal and Poisson approximation together with certain couplings. As a consequence, we give simple new proofs of the fact that the number of fringe trees of size k = kn in the binary...
متن کاملAsymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
We consider conditioned Galton–Watson trees and show asymptotic normality of additive functionals that are defined by toll functions that are not too large. This includes, as a special case, asymptotic normality of the number of fringe subtrees isomorphic to any given tree, and joint asymptotic normality for several such subtree counts. Another example is the number of protected nodes. The offs...
متن کاملStein Couplings to Show Limit Laws for Fringe Trees
The binary search tree or Quicksort is the most used of all sorting algorithm, since it is both fast and simple. The random recursive tree is another extensively studied random tree. We have examined fringe trees in these two types of random trees, since the study of such subtrees appears to be an effective approach towards defining characteristics also of the whole tree. By using a representat...
متن کامل